public class MyCircularQueue {
    public int[] elem;
    public int usedSize;
    public int front; //队头
    public int rear;//队尾
    public MyCircularQueue(int k) {
        this.elem=new int[k];
    }

    public boolean enQueue(int value) {
        if(isFull()){
            return false;
        }
        elem[rear]=value;
        rear=(rear+1)%elem.length;
        return true;
    }

    public boolean deQueue() {
        if(isEmpty())return false;
        front=(front+1)%elem.length;
        return true;
    }

    public int Front() {
        if(isEmpty())return -1;
        return elem[front];
    }
    public int Rear() {
        if(isEmpty())return -1;
        int tmp=(rear==0)?elem.length-1:rear-1;
        return elem[tmp];
    }

    public boolean isEmpty() {
        return rear==front;
    }

    public boolean isFull() {
        return (rear+1)%elem.length==front;
    }
}
